POWERS OF BINOMIAL EDGE IDEALS WITH QUADRATIC GRÖBNER BASES
نویسندگان
چکیده
We study powers of binomial edge ideals associated with closed and block graphs.
منابع مشابه
Binomial Edge Ideals with Quadratic Gröbner Bases
We prove that a binomial edge ideal of a graph G has a quadratic Gröbner basis with respect to some term order if and only if the graph G is closed with respect to a given labelling of the vertices. We also state some criteria for the closedness of a graph G that do not depend on the labelling of its vertex set.
متن کاملOptimal Gröbner Base Algorithms for Binomial Ideals
Little is known about upper complexity bounds for the normal form algorithms which transform a given polynomial ideal basis into a Grr obner basis. In this paper, we exhibit an optimal, exponential space algorithm for generating the reduced Grr obner basis of binomial ideals. This result is then applied to derive space optimal decision procedures for the nite enumeration and subword problems fo...
متن کاملBinomial edge ideals and rational normal scrolls
Let $X=left( begin{array}{llll} x_1 & ldots & x_{n-1}& x_n\ x_2& ldots & x_n & x_{n+1} end{array}right)$ be the Hankel matrix of size $2times n$ and let $G$ be a closed graph on the vertex set $[n].$ We study the binomial ideal $I_Gsubset K[x_1,ldots,x_{n+1}]$ which is generated by all the $2$-minors of $X$ which correspond to the edges of $G.$ We show that $I_G$ is Cohen-Macaula...
متن کاملGröbner bases of ideals invariant under endomorphisms
We introduce the notion of Gröbner S-basis of an ideal of the free associative algebra K〈X〉 over a field K invariant under the action of a semigroup S of endomorphisms of the algebra. We calculate the Gröbner S-bases of the ideal corresponding to the universal enveloping algebra of the free nilpotent of class 2 Lie algebra and of the T-ideal generated by the polynomial identity [x, y, z] = 0, w...
متن کاملBinomial Edge Ideals of Graphs
We characterize all graphs whose binomial edge ideals have a linear resolution. Indeed, we show that complete graphs are the only graphs with this property. We also compute some graded components of the first Betti number of the binomial edge ideal of a graph with respect to the graphical terms. Finally, we give an upper bound for the Castelnuovo-Mumford regularity of the binomial edge ideal of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nagoya Mathematical Journal
سال: 2021
ISSN: ['0027-7630', '2152-6842']
DOI: https://doi.org/10.1017/nmj.2021.1